%0 Conference Proceedings
%4 sid.inpe.br/sibgrapi/2016/08.17.11.54
%2 sid.inpe.br/sibgrapi/2016/08.17.11.54.44
%T An overview of max-tree principles, algorithms and applications
%D 2016
%A Souza, Roberto,
%A Tavares, Luís,
%A Rittner, Letícia,
%A Lotufo, Roberto,
%@affiliation Universidade Estadual de Campinas
%@affiliation Instituto Federal de Educação, Ciência e Tecnologia do Sul de Minas
%@affiliation Universidade Estadual de Campinas
%@affiliation Universidade Estadual de Campinas
%E Aliaga, Daniel G.,
%E Davis, Larry S.,
%E Farias, Ricardo C.,
%E Fernandes, Leandro A. F.,
%E Gibson, Stuart J.,
%E Giraldi, Gilson A.,
%E Gois, João Paulo,
%E Maciel, Anderson,
%E Menotti, David,
%E Miranda, Paulo A. V.,
%E Musse, Soraia,
%E Namikawa, Laercio,
%E Pamplona, Mauricio,
%E Papa, João Paulo,
%E Santos, Jefersson dos,
%E Schwartz, William Robson,
%E Thomaz, Carlos E.,
%B Conference on Graphics, Patterns and Images, 29 (SIBGRAPI)
%C São José dos Campos, SP, Brazil
%8 4-7 Oct. 2016
%I Sociedade Brasileira de Computação
%J Porto Alegre
%S Proceedings
%K max-tree, component tree, filtering, algorithms.
%X The max-tree is a mathematical morphology data structure that represents an image through the hierarchical relationship of connected components resulting from different thresholds. It was proposed in 1998 by Salembier et al., since then, many efficient algorithms to build and process it were proposed. There are also efficient algorithms to extract size, shape and contrast attributes of the max-tree nodes. These algorithms allowed efficient implementation of connected filters like attribute-openings and development of automatic and semi-automatic applications that compete with the state-of-the-art. This paper reviews the max-tree principles, algorithms, applications and its current trends.
%@language en
%3 overview-max-tree.pdf